We study link scheduling in wireless networks under stochastic arrivalprocesses of packets, and give an algorithm that achieves stability in thephysical (SINR) interference model. The efficiency of such an algorithm is thefraction of the maximum feasible traffic that the algorithm can handle withoutqueues growing indefinitely. Our algorithm achieves two important goals: (i)efficiency is independent of the size of the network, and (ii) the algorithm isfully distributed, i.e., individual nodes need no information about the overallnetwork topology, not even local information.
展开▼
